Performance Comparison between Linear RVE and Linear Systolic Array Implementations of the Smith-Waterman Algorithm
نویسندگان
چکیده
In this paper, we present a performance comparison between linear recursive variable expansion (RVE) and linear systolic array implementations of the Smith‐Waterman (S‐ W) algorithm. The results demonstrate that the temporal performance of linear RVE implementation is 2.11 to 3 times better than the traditional linear systolic array implementation at the spatial cost of 2.02 to 2.54.
منابع مشابه
A Systolic Array Architecture for the Smith-Waterman Algorithm with High Performance Cell Design
To infer homology and subsequently gene function, the Smith-Waterman (S-W) algorithm is used to find the optimal local alignment between two sequences. When searching sequence databases that may contain hundreds of millions of sequences, this algorithm becomes computationally expensive. In this paper, we present a systolic array architecture for the S-W algorithm with a new high performance cel...
متن کاملA Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms
In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...
متن کاملA Novel Approach for Accelerating the Smith-Waterman Algorithm using Recursive Variable Expansion
In this paper we implement in hardware, a novel approach for accelerating the S-W algorithm using Recursive Variable Expansion (RVE) technique, which enhances inherent parallelism and exposes extra parallelism as compared to any other technique. The results demonstrate that applying recursive variable expansion technique speeds up the performance by a factor of 3.83, as compared to traditional ...
متن کاملSSW Library: An SIMD Smith-Waterman C/C++ Library for Use in Genomic Applications
BACKGROUND The Smith-Waterman algorithm, which produces the optimal pairwise alignment between two sequences, is frequently used as a key component of fast heuristic read mapping and variation detection tools for next-generation sequencing data. Though various fast Smith-Waterman implementations are developed, they are either designed as monolithic protein database searching tools, which do not...
متن کاملA Memory Efficient Hardware Based Pattern Matching and Protein Alignment Schemes for Highly Complex Databases
Protein sequence alignment to find correlation between different species, or genetic mutations etc. is the most computational intensive task when performing protein comparison. To speed-up the alignment, Systolic Arrays (SAs) have been used. In order to avoid the internal-loop problem which reduces the performance, pipeline interleaving strategy has been presented. This strategy is applied to a...
متن کامل